Limit Measures for Affine Cellular Automata
نویسندگان
چکیده
Let M be a monoid (e.g. N, Z, or Z), and A an abelian group. A is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F : A −→ A that commutes with all shift maps. Let μ be a (possibly nonstationary) probability measure on A; we develop sufficient conditions on μ and F so that the sequence {Fμ}N=1 weak*-converges to the Haar measure on A, in density (and thus, in Cesàro average as well). As an application, we show: if A = Z/p (p prime), F is any “nontrivial” LCA on A( D), and μ belongs to a broad class of measures (including most Bernoulli measures (for D ≥ 1) and “fully supported” N-step Markov measures (when D = 1), then Fμ weak*-converges to Haar measure in density. This research partially supported by NSERC Canada.
منابع مشابه
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
We study the notion of limit sets of cellular automata associated with probability measures (μ-limit sets). This notion was introduced by P. Kůrka and A. Maass in [1]. It is a refinement of the classical notion of ω-limit sets dealing with the typical long term behavior of cellular automata. It focuses on the words whose probability of appearance does not tend to 0 as time tends to infinity (th...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملCommutators of Bipermutive and Affine Cellular Automata
We discuss bipermutive cellular automata from a combinatorial and topological perspective. We prove a type of topological randomizing property for bipermutive CA, show that the commutator of a bipermutive CA is always small and that bipermutive affine CA have only affine CA in their commutator. We show the last result also in the multidimensional case, proving a conjecture of [Moore-Boykett, 97].
متن کاملSelf-organisation in cellular automata with coalescent particles: Qualitative and quantitative approaches
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial configuration at random according to some initial σ-ergodic measure μ, and use the limit measure to descrbe the asymptotic behaviour of the automata. We first take a ...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کامل